Unification of Artificial Intelligence in Robot Motion and Path Planning Via Laplacian Technique

ABSTRACTThe paper deals with Robot motion and path planning in artificial intelligence. The aim of the paper is to develop a path planning programme for mobile robots that is based on laplacian technique. Robot path planning problem is an important combinational content of artificial intelligence and robotics. Its mission is to be independently movement from the starting point to the target point make robots in their work environment while satisfying certain conditions. The conditions may be path collision, obstacles and optimization problems. A Robot is an electro-mechanical device that can perform autonomous or preprogrammed task. A Robot may act as under the direct control of human or autonomously under the control of a programmed computer. Robots may be used to perform tasks that are dangerous or difficult for humans to implement directly or may be used to automate repetitive tasks that can be performed with more precision by a robot than the employment of a human (e.g. automobile production). Robots may be controlled directly by a human, such as remotely controlled bomb disposal robots, robotic arms, or shuttles, or may act according to their own decision making ability, provided by Artificial Intelligence. The field of robotics is closely related to AI. Intelligence is required for robots to be able to handle such tasks as object manipulation and navigation, with sub-problems of localization (knowing where you are, or finding out where other things are), mapping (learning what is around you, building a map of the environment), and motion planning (figuring out how to get there) or path planning (going from one point in space to another point, which may involve compliant motion – where the robot moves while maintaining physical contact with an object). One of the most difficult problems in robotics applications is developing robust autonomous motion planning. In order to build a truly autonomous robot, it must have the capability to efficiently and reliably plan a route from start to the goal point without colliding with obstacles in between. We present an algorithm for path planning to a target for mobile robot in unknown environment. The proposed algorithm allows a mobile robot to navigate through static obstacles, and finding the path in order to reach the target without collision. This algorithm provides the robot the possibility to move from the initial position to the final position (target).